Decompositions Of λKv Into Multigraphs With Four Vertices And Five Edges
نویسندگان
چکیده
This paper is motivated by a survey on the existence of G-designs by Adams, Bryant and Buchanan, where they gave the spectrum of the decomposition of complete graphs into graphs with small numbers of vertices. We give difference family-type constructions to decompose λ copies, where λ ≥ 2, of the complete graph K v into several multigraphs on four vertices and five edges including so called " 2-petal " graphs and " box-edge " graphs.
منابع مشابه
Decompositions of multigraphs into parts with two edges
Given a family F of multigraphs without isolated vertices, a multigraph M is called F-decomposable if M is an edge disjoint union of multigraphs each of which is isomorphic to a member of F . We present necessary and sufficient conditions for the existence of such decompositions if F comprises two multigraphs from the set consisting of a 2-cycle, a 2-matching and a path with two edges.
متن کاملDecompositions of λKv into k-circuits with one chord
Let λKv be the complete multigraph with v vertices, where any two distinct vertices x and y are joined by λ edges {x, y}. Let G be a finite simple graph. A G-design of λKv, denoted by (v,G, λ)-GD, is a pair (X,B), where X is the vertex set of Kv and B is a collection of subgraphs of Kv, called blocks, such that each block is isomorphic to G and any two distinct vertices in Kv are joined in exac...
متن کاملOn nesting of G - decompositions of λK v where G has four nonisolated vertices or less ∗
The complete multigraph λKv is said to have a G-decomposition if it is the union of edge disjoint subgraphs ofKv each of them isomorphic to a fixed graph G. The spectrum problem forG-decompositionsof λKv that have a nesting was first considered in the caseG = K3 by C.J.Colbourn and M.J.Colbourn [4] and D.R. Stinson [15]. For λ = 1 and G = Cm (the cycle of length m) this problem was studied in m...
متن کاملG-designs, G-packings and G-coverings of λKv with a bipartite graph G of six vertices
Let λKv be the complete multigraph with v vertices, where any two distinct vertices x and y are joined by λ edges (x, y). Let G be a finite simple graph. A G-design (G-packing, G-covering) of λKv, is denoted by (v,G, λ)-GD ((v,G, λ)-PD, (v,G, λ)-CD). In this paper, we determine the existence spectrum for the G-designs of λKv, λ > 1, and construct the maximum packings and the minimum coverings o...
متن کاملGraph designs, packings and coverings of λKv with a graph of six vertices and containing a triangle
Let λKv be the complete multigraph with v vertices, where any two distinct vertices x and y are joined by λ edges (x, y). Let G be a finite simple graph. A G-design (G-packing, G-covering) of λKv, denoted by (v,G, λ)-GD ((v,G, λ)-PD, (v,G, λ)-CD), is a pair (X,B) where X is the vertex set of Kv and B is a collection of subgraphs of Kv, called blocks, such that each block is isomorphic to G and ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Ars Comb.
دوره 136 شماره
صفحات -
تاریخ انتشار 2018